Independent parallelism in finite copying parallel rewriting systems

Ageing Orders of Series-Parallel and Parallel-Series Systems with Independent Subsystems Consisting of Dependent Components

In this paper, we consider series-parallel and parallel-series systems with independent subsystems consisting of dependent homogeneous components whose joint lifetimes are modeled by an Archimedean copula. Then, by considering two such systems with different numbers of components within each subsystem, we establish hazard rate and reversed hazard rate orderings between the two system lifetimes,...

Parallel Graph Rewriting Systems

Reversibility in Parallel Rewriting Systems

This paper represents a study of reversibility in parallel rewriting systems over multisets. It emphasizes the controlled reversibility for a particular case of parallel rewriting systems given by membrane systems, a formalism inspired by the cell activity. We define reversible membrane systems in which the scenarios based on regular expressions are able to control the direction (forward or bac...

Extending Graph Rewriting with Copying

The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a connu-ence result is obtained for these so-called copy term graph rewrite systems (C-TGRS). Some ideas on the use of lazy copying in practice are presented .

Parallel Array-rewriting P Systems

A variant of array-rewriting P systems that uses parallel rewriting of arrays in the regions is introduced. The generative power of this model is compared with certain array grammars generating array languages. It is shown that geometric arrays such as hollow rectangles and hollow squares can be generated by parallel array P systems with a priority relation on the rules. The advantage of the pr...